0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : satallax -s schedule_3_1 -E eprover -P picomus -M modes -p tstp -t %d %s
0.02/0.23	% Computer   : n131.star.cs.uiowa.edu
0.02/0.23	% Model      : x86_64 x86_64
0.02/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.23	% Memory     : 32218.625MB
0.02/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.23	% CPULimit   : 300
0.02/0.23	% DateTime   : Sun Jul 15 13:13:40 CDT 2018
0.02/0.23	% CPUTime    : 
111.68/111.96	% SZS status Theorem
111.68/111.96	% Mode: mode447
111.68/111.96	% Inferences: 1177
111.68/111.96	% SZS output start Proof
111.68/111.96	thf(ty_$i, type, $i : $tType).
111.68/111.96	thf(ty_zero, type, zero : $i).
111.68/111.96	thf(ty_s, type, s : ($i>$i)).
111.68/111.96	thf(ty_ite, type, ite : ($o>$i>$i>$i)).
111.68/111.96	thf(sP1,plain,(sP1 <=> (![X1:$i]:(![X2:$i]:((~((zero = (s @ zero)))) => ((((ite @ (zero = (s @ zero))) @ X1) @ X2) = X2)))),introduced(definition,[new_symbols(definition,[sP1])]))).
111.68/111.96	thf(sP2,plain,(sP2 <=> (![X1:$o]:(![X2:$i]:(![X3:$i]:((~(X1)) => ((((ite @ X1) @ X2) @ X3) = X3))))),introduced(definition,[new_symbols(definition,[sP2])]))).
111.68/111.96	thf(sP3,plain,(sP3 <=> ((zero = zero) => ((((ite @ (zero = zero)) @ (s @ zero)) @ zero) = (s @ zero))),introduced(definition,[new_symbols(definition,[sP3])]))).
111.68/111.96	thf(sP4,plain,(sP4 <=> ((((ite @ (zero = (s @ zero))) @ (s @ zero)) @ zero) = zero),introduced(definition,[new_symbols(definition,[sP4])]))).
111.68/111.96	thf(sP5,plain,(sP5 <=> (![X1:$i]:(![X2:$i]:((zero = zero) => ((((ite @ (zero = zero)) @ X1) @ X2) = X1)))),introduced(definition,[new_symbols(definition,[sP5])]))).
111.68/111.96	thf(sP6,plain,(sP6 <=> (zero = zero),introduced(definition,[new_symbols(definition,[sP6])]))).
111.68/111.96	thf(sP7,plain,(sP7 <=> (![X1:$i]:((~((zero = (s @ zero)))) => ((((ite @ (zero = (s @ zero))) @ (s @ zero)) @ X1) = X1))),introduced(definition,[new_symbols(definition,[sP7])]))).
111.68/111.96	thf(sP8,plain,(sP8 <=> (![X1:$o]:(![X2:$i]:(![X3:$i]:(X1 => ((((ite @ X1) @ X2) @ X3) = X2))))),introduced(definition,[new_symbols(definition,[sP8])]))).
111.68/111.96	thf(sP9,plain,(sP9 <=> (![X1:$i>$i]:(((X1 @ (s @ zero)) = zero) => (~(((X1 @ zero) = (s @ zero)))))),introduced(definition,[new_symbols(definition,[sP9])]))).
111.68/111.96	thf(sP10,plain,(sP10 <=> (![X1:$i]:(sP6 => ((((ite @ sP6) @ (s @ zero)) @ X1) = (s @ zero)))),introduced(definition,[new_symbols(definition,[sP10])]))).
111.68/111.96	thf(sP11,plain,(sP11 <=> ((~((zero = (s @ zero)))) => sP4),introduced(definition,[new_symbols(definition,[sP11])]))).
111.68/111.96	thf(sP12,plain,(sP12 <=> (zero = (s @ zero)),introduced(definition,[new_symbols(definition,[sP12])]))).
111.68/111.96	thf(sP13,plain,(sP13 <=> (sP4 => (~(((((ite @ sP6) @ (s @ zero)) @ zero) = (s @ zero))))),introduced(definition,[new_symbols(definition,[sP13])]))).
111.68/111.96	thf(sP14,plain,(sP14 <=> (sP6 => (~(sP12))),introduced(definition,[new_symbols(definition,[sP14])]))).
111.68/111.96	thf(sP15,plain,(sP15 <=> ((((ite @ sP6) @ (s @ zero)) @ zero) = (s @ zero)),introduced(definition,[new_symbols(definition,[sP15])]))).
111.68/111.96	thf(n8,conjecture,((~((sP8 => (~(sP2))))) => (~(sP9)))).
111.68/111.96	thf(h0,negated_conjecture,(~(((~((sP8 => (~(sP2))))) => (~(sP9))))),inference(assume_negation,[status(cth)],[n8])).
111.68/111.96	thf(h1,assumption,(~((sP8 => (~(sP2))))),introduced(assumption,[])).
111.68/111.96	thf(h2,assumption,sP9,introduced(assumption,[])).
111.68/111.96	thf(h3,assumption,sP8,introduced(assumption,[])).
111.68/111.96	thf(h4,assumption,sP2,introduced(assumption,[])).
111.68/111.96	thf(1,plain,(~(sP9) | sP14),inference(all_rule,[status(thm)],[])).
111.68/111.96	thf(2,plain,((~(sP14) | ~(sP6)) | ~(sP12)),inference(prop_rule,[status(thm)],[])).
111.68/111.96	thf(3,plain,sP6,inference(prop_rule,[status(thm)],[])).
111.68/111.96	thf(4,plain,(~(sP2) | sP1),inference(all_rule,[status(thm)],[])).
111.68/111.96	thf(5,plain,(~(sP1) | sP7),inference(all_rule,[status(thm)],[])).
111.68/111.96	thf(6,plain,(~(sP9) | sP13),inference(all_rule,[status(thm)],[])).
111.68/111.96	thf(7,plain,(~(sP7) | sP11),inference(all_rule,[status(thm)],[])).
111.68/111.96	thf(8,plain,((~(sP13) | ~(sP4)) | ~(sP15)),inference(prop_rule,[status(thm)],[])).
111.68/111.96	thf(9,plain,((~(sP11) | sP12) | sP4),inference(prop_rule,[status(thm)],[])).
111.68/111.96	thf(10,plain,((~(sP3) | ~(sP6)) | sP15),inference(prop_rule,[status(thm)],[])).
111.68/111.96	thf(11,plain,(~(sP10) | sP3),inference(all_rule,[status(thm)],[])).
111.68/111.96	thf(12,plain,(~(sP5) | sP10),inference(all_rule,[status(thm)],[])).
111.68/111.96	thf(13,plain,(~(sP8) | sP5),inference(all_rule,[status(thm)],[])).
111.68/111.96	thf(14,plain,$false,inference(prop_unsat,[status(thm),assumptions([h3,h4,h1,h2,h0])],[h2,h4,h3,1,2,3,4,5,6,7,8,9,10,11,12,13])).
111.68/111.96	thf(15,plain,$false,inference(tab_negimp,[status(thm),assumptions([h1,h2,h0]),tab_negimp(discharge,[h3,h4])],[h1,14,h3,h4])).
111.68/111.96	thf(16,plain,$false,inference(tab_negimp,[status(thm),assumptions([h0]),tab_negimp(discharge,[h1,h2])],[h0,15,h1,h2])).
111.68/111.96	thf(0,theorem,((~((sP8 => (~(sP2))))) => (~(sP9))),inference(contra,[status(thm),contra(discharge,[h0])],[16,h0])).
111.68/111.96	% SZS output end Proof
111.68/111.97	EOF